منابع مشابه
Index Concurrency Control in Firm Real-Time DBIM:S
Although real-time transaction concurrency control has been extensively studied, the design and evaluation of real-time in&l: concurrency control algorithms has not yet been considered. In this paper, we develop real-time variants of several classical B-tree concurrency control algorithms and compare their performance using a detailed simulation model of a firm-deadline real-time database syste...
متن کاملIndex Concurrency Control in Firm Real{Time DBMS
Although real-time transaction concurrency control has been extensively studied, the design and evaluation of real-time index concur-rency control algorithms has not yet been considered. In this paper, we develop real-time variants of several classical B-tree concurrency control algorithms and compare their performance using a detailed simulation model of a rm-deadline real-time database system...
متن کاملReai-Time Index Concurrency Control
Research on real-time database systems (RTDBS) has been underway for close to a decade now. So far, this research has focused mainly o11 identifying the appropriate choice, with respect to meeting the real-time goals, for the various database system policies such as priority assignment, transaction concurrency control, memory management, etc. (see [16] for a recent survey). However, the design ...
متن کاملSpeculative Concurrency Control for Real-Time Databases
In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that serializable schedules are found and executed as early as possible, thus, increasing the chances of a timely commitment of transactions with strict timing constraints. Due to i...
متن کاملSpeculative Concurrency Control for Real-Time Databases
In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that serializable schedules are found and executed as early as possible, thus, increasing the chances of a timely commitment of transactions with strict timing constraints. Due to i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 1996
ISSN: 0163-5808
DOI: 10.1145/381854.381870